Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
2nd(cons1(X,cons(Y,Z))) |
→ Y |
| 2: |
|
2nd(cons(X,X1)) |
→ 2nd(cons1(X,X1)) |
| 3: |
|
from(X) |
→ cons(X,from(s(X))) |
|
There are 2 dependency pairs:
|
| 4: |
|
2nd#(cons(X,X1)) |
→ 2nd#(cons1(X,X1)) |
| 5: |
|
FROM(X) |
→ FROM(s(X)) |
|
The approximated dependency graph contains one SCC:
{5}.
-
Consider the SCC {5}.
There are no usable rules.
The constraints could not be solved.
Tyrolean Termination Tool (0.01 seconds)
--- May 4, 2006